Two Techniques for Tractable Decision-Theoretic Planning
نویسندگان
چکیده
Two techniques to provide inferential tractability for decision-theoretic planning are discussed. Knowledge compilation is a speedup technique that pre-computes intermediate quantifies of a domain model to yield a more efficiently executable model. The basic options for compiling decision-theoretic models are defined, leading to the most compiled model in the form of parameterized, conditionaction decision rules. We describe a general compilation algorithm that can be applied to dynamic influence diagrams for sequential decision-making. Decision-theoretic raetareasoning is a control technique that regulates the online replanning. This algorithm focuses on the most promising areas to replan and considers the time cost of replanning.
منابع مشابه
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member’s preference. We refer to the decision process that leads to such a plan as package planning. The problem differs from a number of well-studied AI problems including standard AI planning and decision-theoretic planning. We pre...
متن کاملOptimizing, diagnostic, and therapeutic strategies using decision-theoretic planning: principles and applications.
OBJECTIVE Decision-theoretic planning is a new technique for selecting optimal actions. The authors sought to determine whether decision-theoretic planning could be applied to medical decision making to identify optimal strategies for diagnosis and therapy. METHODS An existing model of acute deep venous thrombosis (DVT) of the lower extremities--in which 24 management strategies were compared...
متن کاملcient Decision - Theoretic Planning : Techniques and EmpiricalAnalysisPeter
This paper discusses techniques for performing eecient decision-theoretic planning. We give an overview of the drips decision-theoretic reenement planning system, which uses abstraction to eeciently identify optimal plans. We present techniques for automatically generating search control information , which can signiicantly improve the planner's performance. We evaluate the ee-ciency of drips b...
متن کاملScaling Up Decision Theoretic Planning to Planetary Rover Problems
Because of communication limits, planetary rovers must operate autonomously during consequent durations. The ability to plan under uncertainty is one of the main components of autonomy. Previous approaches to planning under uncertainty in NASA applications are not able to address the challenges of future missions, because of several apparent limits. On another side, decision theory provides a s...
متن کاملSidekick agents for sequential planning problems
Effective Al sidekicks must solve the interlinked problems of understanding what their human collaborator's intentions are and planning actions to support them. This thesis explores a range of approximate but tractable approaches to planning for AI sidekicks based on decision-theoretic methods that reason about how the sidekick's actions will effect their beliefs about unobservable states of th...
متن کامل